Shift scheduling in services when employees have limited availability: An L.P. approach

Scheduling with limited machine availability

Shift Scheduling Model Designed to Level Workloads of Employees

This paper focuses on the staff shift scheduling problem on luxury hotel restaurant. Effective staff scheduling has always been a concern for restaurant managers. This paper addresses this issue by investigating the nature of restaurant jobs, ultimately proposing a Shift Scheduling Model designed to level workloads of employees in restaurant service at these establishments. This model creates s...

Scheduling jobs in open shops with limited machine availability

In this paper, open shop scheduling problems with limited machine availability are studied. Such a limited availability of machines may appear in many real-life situations, e.g. as preventive maintenance activities. Three types of jobs are distinguished: nonpreemptable, resumable and preemptable. An operation of a resumable job if not completed before a non-availability period of a machine may ...

A Market-Utility Approach to Scheduling Employees

Excerpt] Scheduling front-line service providers is a constant challenge for hospitality managers, given the inevitable tradeoff between service standards and operating expense. Traditional employee scheduling typically applies a cost-minimization approach to specify the level of front-line service providers who will be available to meet periodic demand. That cost includes the opportunity cost ...

Scheduling preemptable tasks on parallel processors with limited availability

It is well known that in the majority of cases the problem of preemptive task scheduling on m parallel identical processors with the objective of minimizing makespan can be solved in polynomial time. For example, for tree-like precedence constraints the algorithm of Muntz and Co€man can be applied. In this paper, this problem is generalized to cover the case of parallel processors which are ava...